Magic numbers in the state hierarchy of finite automata
نویسندگان
چکیده
منابع مشابه
Normal numbers and finite automata
We give an elementary and direct proof of the following theorem: A real number is normal to a given integer base if, and only if, its expansion in that base is incompressible by lossless finite-state compressors (these are finite automata augmented with an output transition function such that the automata input-output behaviour is injective; they are also known as injective finite-state transdu...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملResidual Finite State Automata
We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover,...
متن کاملRepresentation of Finite State Automata
In this paper, we propose some techniques for injecting nite state automata into Recurrent Radial Basis Function networks (R 2 BF). When providing proper hints and constraining the weight space properly, we show that these networks behave as automata. A technique is suggested for forcing the learning process to develop automata representations that is based on adding a proper penalty function t...
متن کاملRobustness of Finite State Automata
The classical robust control deals with systems which can be approximated by nite order linear time-invariant (LTI) models, uses integral constraints, such as induced gain bounds, to assess robustness with respect to the error of such approximation, and employs H-In nity optimization to design robust linear controllers. In this paper, a parallel approach is developed, in which nite state stocha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2007
ISSN: 0890-5401
DOI: 10.1016/j.ic.2007.07.001